P versus NP problem - PDFSEARCH.IO - Document Search Engine

P versus NP problem
Results: 202

#	Item
151	THE P VERSUS NP PROBLEM STEPHEN COOK Add to Reading List Source URL: www.claymath.org Language: English - Date: 2013-08-12 10:39:14 Complexity classes NP-hard P versus NP problem NP P Bounded-error probabilistic polynomial Oracle machine Reduction Time complexity Theoretical computer science Computational complexity theory Applied mathematics
152	A Brief History of NP-Completeness, 1954–2012 David S. Johnson Mathematics subject classification: 68-03, 68Q17, 68Q25, 68W25, 90C05, 90C22 Add to Reading List Source URL: www.research.att.com Language: English - Date: 2012-09-06 18:30:18 Complexity classes NP-complete Cook–Levin theorem P versus NP problem NP-hard NP Stephen Cook Clique problem P Theoretical computer science Computational complexity theory Applied mathematics
153	ICM 2002 • Vol. I • 245^272 Mathematical Foundations of Add to Reading List Source URL: www.mathunion.org Language: English - Date: 2012-04-18 10:56:38 Complexity classes Pseudorandomness Analysis of algorithms Probabilistic complexity theory One-way function Hard-core predicate NP P versus NP problem Time complexity Theoretical computer science Computational complexity theory Applied mathematics
154	Proceedings of the International Congress of Mathematicians Hyderabad, India, 2010 Add to Reading List Source URL: www.mathunion.org Language: English - Date: 2013-04-24 07:33:09 Complexity classes Probabilistic complexity theory Mathematical optimization NP-complete problems Probabilistically checkable proof NP PCP theorem P versus NP problem MAX-3SAT Theoretical computer science Computational complexity theory Applied mathematics
155	P , NP and mathematics – a computational complexity perspective Avi Wigderson Add to Reading List Source URL: www.mathunion.org Language: English - Date: 2012-04-18 10:58:44 Complexity classes P versus NP problem Co-NP NP P Decision problem Time complexity Reduction NP-complete Theoretical computer science Computational complexity theory Applied mathematics
156	Theoretical Elsevier Add to Reading List Source URL: researcher.ibm.com Language: English - Date: 2006-12-11 17:42:17 Model theory Descriptive complexity theory Finite model theory Compactness theorem Satisfiability First-order logic FO Interpretation P versus NP problem Logic Mathematical logic Mathematics
157	An Argument for P=NP Selmer Bringsjord & Joshua Taylor∗ Department of Cognitive Science Add to Reading List Source URL: kryten.mm.rpi.edu Language: English - Date: 2006-08-15 08:38:25 Complexity classes Computability theory Theory of computation Mathematical optimization NP-complete P versus NP problem NP P Halting problem Theoretical computer science Computational complexity theory Applied mathematics
158	i Computational Complexity: A Modern Add to Reading List Source URL: www.cs.princeton.edu Language: English - Date: 2007-01-08 22:00:26 Complexity classes NP P versus NP problem Cook–Levin theorem P Boolean satisfiability problem Reduction Time complexity Co-NP-complete Theoretical computer science Computational complexity theory Applied mathematics
159	offprint from: M ixail N. Bogoljubov et al. (eds.): Indoiranskoe jazykoznanie i tipologija jazykovyx situacij. Sbornik statej k 75-letiju professora A. L. Grjunberga[removed]St. Petersburg: Nauka, pp[removed] Add to Reading List Source URL: titus.uni-frankfurt.de Language: English - Date: 2011-10-17 10:18:29 Iranian peoples Complexity classes Mathematical optimization Ethnic groups in Pakistan Balochi language P versus NP problem NP Baloch people Iranian languages Theoretical computer science Asia Balochistan
160	ÎÃ Eﬃcient computational proofs Add to Reading List Source URL: www.nada.kth.se Language: English - Date: 2004-07-02 12:52:43 Mathematical optimization Computational complexity theory Conjectures P versus NP problem Structural complexity theory NP Approximation algorithm Theoretical computer science Applied mathematics Complexity classes